package fr.neyb.bernouilli.problem005;

import fr.neyb.bernouilli.common.math.Factorized;

public class Entry {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Factorized result = new Factorized(2);
		for (int i = 2; i <= 100; i++) {
			result = Factorized.Merge_KeepBiggestFactors(result, new Factorized(i));
		}
		System.out.println(result+"="+result.toLong());
	}

}
